Linear Dispersion Codes Selection Based on Grassmannian Subspace Packing
نویسنده
چکیده
Subspace Packing Dan Deng, Student Member, IEEE, and Jinkang Zhu, Member, IEEE Abstract: A new method to design codebook is proposed for Linear Dispersion Code (LDC) systems with limited feedback. The extended codebook design method is introduced based on Grassmannian subspace packing and a mapping function, which is derived from the relationship between SVDs of the classical multiplexing systems and the LDC systems. Our proposed codebook can guarantee the maximum min-distance of the finite set. Simulation results show that, for 2×2 MIMO systems, if the feedback bit number is 4, the proposed codebook shows the similar performance to the optimal precoding codebook and has substantial performance advantage against the random search codebook.
منابع مشابه
Packing and Covering Properties of CDCs and Subspace Codes
Codes in the projective space over a finite field, referred to as subspace codes, and in particular codes in the Grassmannian, referred to as constant-dimension codes (CDCs), have been proposed for error control in random network coding. In this paper, we first study the covering properties of CDCs. We determine some fundamental geometric properties of the Grassmannian. Using these properties, ...
متن کاملCombinatorial Bounds for List Decoding of Subspace Codes
Abstract—Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices of the corresponding Grassmannian graph....
متن کاملCombinatorial Bounds for List Decoding of Subspace Codes (Extended Version)
Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as unconditionally secure authentication codes and random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices o...
متن کاملList Decoding of Subspace Codes
Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as unconditionally secure authentication codes and random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices o...
متن کاملAn improvement of the Johnson bound for subspace codes
Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective qr-divisible codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007